The Dichotomy of Minimum Cost Homomorphism Problems for Digraphs
نویسندگان
چکیده
The minimum cost homomorphism problem has arisen as a natural and useful optimization problem in the study of graph (and digraph) coloring and homomorphisms: it unifies a number of other well studied optimization problems. It was shown by Gutin, Rafiey, and Yeo that the minimum cost problem for homomorphisms to a digraph H that admits a so-called extended MinMax ordering is polynomial time solvable, and these authors conjectured that for all other digraphs H the problem is NP-complete. In a companion paper, we gave a forbidden structure characterization of digraphs that admit extended Min-Max orderings. In this paper, we apply this characterization to prove Gutin’s conjecture.
منابع مشابه
Minimum Cost Homomorphism to Oriented Cycles with Some Loops
For digraphs D and H, a homomorphism of D to H is a mapping f : V (D)→V (H) such that uv ∈ A(D) implies f(u)f(v) ∈ A(H). Suppose D and H are two digraphs, and ci(u), u ∈ V (D), i ∈ V (H), are nonnegative real costs. The cost of the homomorphism f of D to H is ∑ u∈V (D) cf(u)(u). The minimum cost homomorphism for a fixed digraph H, denoted by MinHOM(H), asks whether or not an input digraphD, wit...
متن کاملMinimum Cost Homomorphisms to Semicomplete Bipartite Digraphs
For digraphs D and H, a mapping f : V (D)→V (H) is a homomorphism of D to H if uv ∈ A(D) implies f(u)f(v) ∈ A(H). If, moreover, each vertex u ∈ V (D) is associated with costs ci(u), i ∈ V (H), then the cost of the homomorphism f is ∑ u∈V (D) cf(u)(u). For each fixed digraph H, we have the minimum cost homomorphism problem for H. The problem is to decide, for an input graph D with costs ci(u), u...
متن کاملMinimum cost homomorphisms to locally semicomplete digraphs and quasi-transitive digraphs
For digraphs G and H, a homomorphism of G to H is a mapping f : V (G)→V (H) such that uv ∈ A(G) implies f(u)f(v) ∈ A(H). If, moreover, each vertex u ∈ V (G) is associated with costs ci(u), i ∈ V (H), then the cost of a homomorphism f is ∑ u∈V (G) cf(u)(u). For each fixed digraph H, the minimum cost homomorphism problem for H, denoted MinHOM(H), can be formulated as follows: Given an input digra...
متن کاملMinimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs
For digraphs G and H , a homomorphism of G to H is a mapping f : V (G)→V (H) such that uv ∈ A(G) implies f(u)f(v) ∈ A(H). If, moreover, each vertex u ∈ V (G) is associated with costs ci(u), i ∈ V (H), then the cost of a homomorphism f is ∑ u∈V (G) cf(u)(u). For each fixed digraph H , the minimum cost homomorphism problem for H , denoted MinHOM(H), can be formulated as follows: Given an input di...
متن کاملMinimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs
For digraphs G and H , a homomorphism of G to H is a mapping f : V (G)→V (H) such that uv ∈ A(G) implies f(u)f(v) ∈ A(H). In the minimum cost homomorphism problem we associate costs ci(u), u ∈ V (G), i ∈ V (H) with the mapping of u to i and the cost of a homomorphism f is defined ∑ u∈V (G) cf(u)(u) accordingly. Here the minimum cost homomorphism problem for a fixed digraph H , denoted by MinHOM...
متن کاملDuality for Min-Max Orderings and Dichotomy for Min Cost Homomorphisms
Min-Max orderings correspond to conservative lattice polymorphisms. Digraphs with Min-Max orderings have polynomial time solvable minimum cost homomorphism problems. They can also be viewed as digraph analogues of proper interval graphs and bigraphs. We give a forbidden structure characterization of digraphs with a Min-Max ordering which implies a polynomial time recognition algorithm. We also ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 26 شماره
صفحات -
تاریخ انتشار 2012